Commitment-based device-pairing protocol with synchronized drawings and comparison metrics

This article presents a new method for pairing devices securely. The commitment-based authentication uses a fuzzy secret that the devices only know approximately. Its novel feature is time-based opening of commitments in a single round. We also introduce a new source for the fuzzy secret: synchronized drawing with two fingers of the same hand on two touch screens or surfaces. The drawings are encoded as strings and compared with an edit-distance metric. A prototype implementation of this surprisingly simple and natural pairing mechanism shows that it accurately differentiates between true positives and man-in-the-middle attackers.     

On the relationship between squared pairings and plain pairings

In this paper, we investigate the relationship between the squared Weil/Tate pairing and the plain Weil/Tate pairing. Along these lines, we first show that the squared pairing for an arbitrary chosen point can be transformed into the plain pairing for a trace zero point which has a special form to compute them more efficiently. Then the optimizations made for computing squared pairings are combined with the computation of pairings on these trace zero points, to achieve even better performance for the computation of the 4th powered Weil pairing.     

基于环境选择和配对选择的多目标粒子群算法

为了使多目标粒子群算法中种群粒子能够快速地收敛于怕累托最优边界,针对标准多目标粒子群算法中缺乏粒子评价标准以及种群个体历史最优值位置和全局最优值位置选择问题,提出了一种基于环境选择和配对选择策略的多目标粒子群算法.该算法在每次迭代时,采用SPEA2中的环境选择和配对选择策略及适应度值计算方法,以此来提高种群粒子之间的信息交换力度,减少标准多目标粒子群算法中大量的随机性,使种群粒子能够更快速地收敛于怕累托最优边界.经典测试函数的仿真实验结果表明,在标准多目标粒子群算法中运用SPEA2的环境选择、配对选择策略和适应度值计算方法,能够使种群粒子更快速地收敛于帕累托最优边界,验证了算法改进的可行性和有效性.     

无双线性对的无证书安全签密方案

已有的无双线性对的无证书签密方案,大都存在着机密性漏洞和签名选择性伪造问题。针对此问题,基于有限乘法交换群上的离散对数难题,提出一种无双线性对的无证书签密方案,并进行了安全分析和证明。指出采用随机预言模型的证明方法可能忽略不解决DL难题时对签密方案的攻击,不能证明破解签密方案的难度与解决DL难题相等价。通过对参数的数学分析,证明了破解本签密方案的必要条件是解决DL难题,不存在不解决DL难题攻击本签密方案的多项式时间算法。与已知所有方案相比,所提方案安全性更高。     

P2P网络中基于身份的消息链接密钥隔离加密

针对P2P网络中存在密钥泄露和大量数据加密传输困难的问题,采用密钥隔离机制和消息分组链接加密的方法,提出一种具有消息链接性的基于身份密钥隔离加密方案。在随机预言机模型下给出形式化证明,该方案在双线性Deffie-Hellman假设成立的条件下,满足适应性选择消息攻击不可区分性,且该方案具有非限定时间周期以及随机存取密钥更新的性质。性能分析结果表明,该方案的密文长度仅为基本密钥隔离加密方案的一半,适用于P2P网络中传输大量的加密数据。     

一个安全的两方认证密钥协商协议简

在不安全的通信环境中,如何安全有效地保障用户之间信息的传递是一个倍受关注的问题。认证密钥协商协议是解决该问题方法之一。基于李发根等人的签密方案,提出了一个安全的两方认证密钥协商协议。方案的安全性分析表明,该协议不仅具有传统的基于身份的密码方案的核心功能,而且还很好地消除了基于身份密码方案中存在的密钥托管问题。     

一种高效的基于身份的部分盲签名方案*

提出了一个新的基于身份的部分盲签名方案,证明了所提方案的完整性、部分盲性和不可伪造性,并比较了所提方案与现有方案的计算代价,比较结果显示所提方案是目前效率较高的基于身份的部分盲签名方案。     

标准模型下基于身份的广义签密方案*

首次对标准模型下基于身份广义签密体制进行了研究。利用双线性对,提出了基于身份的广义签密方案, 并在标准模型下证明了方案的安全性。结果表明,方案的保密性在DBDH假设下是适应性选择密文攻击下不可区分的,在CDHP假设下方案是适应性选择消息攻击下存在性不可伪造的。与其他两个基于身份广义签密方案相比,本方案效率较高,且是在标准模型下可证明是安全的。     

Estimating performance enhancement with alternate control strategies for multiloop control systems

A filter based methodology, studied earlier for SISO systems, is extended to MIMO systems. The presented approach facilitates the calculation of best achievable performance for proportional-integral (PI) controller and the optimal multiloop (ML) PI settings for stochastic disturbance rejection in ML control systems. The filter based approach is further extended to answer some of the key questions for ML control systems such as: (a) performance enhancement possible with the alternate pairing scheme, (b) benefits that will accrue through the employment of decouplers and (c) the performance achievable with the use of multivariable controller (as opposed to an ML controller). Further, the trade-off curve between output variance and control effort is generated for the various control configurations within PI controller domain.     

Low-complexity optimal spatial channel pairing for AF-based multi-pair two-way relay networks

This paper considers a multi-pair two-way relay system with multi-antenna users and proposes a low-complexity optimal spatial channel pairing （SCP） strategy at the relay station （RS） for such a system. The proposed SCP scheme, following the BD-like beamformer at RS, pairs the uplink spatial subchannels of each user pair with the corresponding downlink spatial subchannels by maximizing sum-rate （Max-SR）. Furthermore, a new mathematical inequality （arrangement inequalities of a product） is developed and applied to obtain sufficient and necessary conditions for achieving Max-SR-SCP. This also yields a simple low-complexity implementation of the proposed SCP in contrast to the NP-hard complexity of the original Max-SR-SCP problem. Simulation results illustrate that the proposed Max-SR-SCP achieves substantial sum-rate gains over other pairing schemes.